A Novel Practical Certificate-Less Digital Signing System Based on Super-Elliptic Bilinear Map Parings

In this paper, we propose a novel practical Certificate-Less digital signing system based on bilinear map pairings defined on super elliptic curve, which is proved more efficiency than some similar systems pioneered heretofore as viewed from information security application widely applied in mobile-thin computation environment often with a narrow communication bandwidth concomitant. For a long span, the complex managing public key certificate job involved in crypto-system based on identity has been keeping from a more efficient digital signing and disturbing engineers engaging in designing secure mobile E-Commerce. By this scheme, signing subroutine can be in no need of pairscomputation, and verifying can be performed only at cost of 3 times pairs-computation while not introducing special hash function, a necessity in some similar schemes initiated in some references. With respect to security, the system manifests a satisfying immunity from Replacing Public Key Attack, Forging Signature Attack and some other typical attack methods from angle of computability of NP-problem and of provable security. By comparison and analysis in detail and in depth, it is made clear that the signing system can provide a favorable macro-availability and performance, and be fit to be promoted into the application of mobile ECommerce and some similar requirements.